Adaptive Wormhole Routing in Mesh-Hypercube Network
نویسندگان
چکیده
منابع مشابه
Adaptive Algorithms for Wormhole-Routed Single-Port Mesh- Hypercube Network
In this research, adaptive wormhole routing algorithms are proposed. The algorithms presented for both unicast and multicast communication for single-port Mesh Hypercube (MH) network. MH introduced as a new interconnection network for parallel systems. The basic structure for it is a blend of both mesh and hypercube networks. It combines the desirable features of both the hypercube and the mesh...
متن کاملAdaptive Wormhole Routing in Hypercube Multicomputers
In this paper, we propose a uniform adaptive routing strategy for wormhole-routed hypercube networks that accommodates both unicast and multicast communication. Based on a node labeling method, the resultant routing algorithms are shown to be deadlock-free without requiring virtual channels. The order in which the destinations are visited is important to ee-ciency. We present an ordering algori...
متن کاملAdaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کاملAdaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. Based on the concept of unsafe nodes, we design a routing algorithm for hypercubes that can tolerate at least n 1 node faults and can route a message via a path of length no more than the Hamming distance between the s...
متن کاملAdaptive Multicast Wormhole Routing in 2D Mesh Multicomputers
We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2004
ISSN: 1812-5654
DOI: 10.3923/jas.2004.568.574